Imprimitive symmetric graphs with cyclic blocks
نویسندگان
چکیده
منابع مشابه
Imprimitive symmetric graphs with cyclic blocks
Let Γ be a graph admitting an arc-transitive subgroup G of automorphisms that leaves invariant a vertex partition B with parts of size v ≥ 3. In this paper we study such graphs where: for B, C ∈ B connected by some edge of Γ , exactly two vertices of B lie on no edge with a vertex of C; and as C runs over all parts of B connected to B these vertex pairs (ignoring multiplicities) form a cycle. W...
متن کاملImprimitive Symmetric Graphs
A finite graph Γ is said to be G-symmetric if G is a group of automorphisms of Γ acting transitively on the ordered pairs of adjacent vertices of Γ. In most cases, the group G acts imprimitively on the vertices of Γ, that is, the vertex set of Γ admits a nontrivial G-invariant partition B. The purpose of this thesis is to study such graphs, called imprimitive G-symmetric graphs. In the first pa...
متن کاملA Local Analysis of Imprimitive Symmetric Graphs
Let be a G-symmetric graph admitting a nontrivial G-invariant partition B. Let B be the quotient graph of with respect to B. For each block B ∈ B, the setwise stabiliser G B of B in G induces natural actions on B and on the neighbourhood B(B) of B in B . Let G(B) and G[B] be respectively the kernels of these actions. In this paper we study certain “local actions” induced by G(B) and G[B], such ...
متن کاملImprimitive symmetric graphs, 3-arc graphs and 1-designs
Let be a G-symmetric graph admitting a nontrivial G-invariant partition B. For B∈B, let D(B)= (B; B(B); I) be the 1-design in which IC for ∈B and C ∈ B(B) if and only if is adjacent to at least one vertex of C, where B(B) is the neighbourhood of B in the quotient graph B of relative to B. In a natural way the setwise stabilizer GB of B in G induces a group of automorphisms of D(B). In this pape...
متن کاملImprimitive flag-transitive symmetric designs
A recent paper of O’Reilly Regueiro obtained an explicit upper bound on the number of points of a flagtransitive, point-imprimitive, symmetric design in terms of the number of blocks containing two points. We improve that upper bound and give a complete list of feasible parameter sequences for such designs for which two points lie in at most ten blocks. Classifications are available for some of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2010
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2009.02.006